XBarnacle: Making Theorem Provers More Accessible
نویسندگان
چکیده
XBarnacle was built to meet the challenge of incorporating interactive features in the automated theorem prover CLAM whilst preserving the advantages of automation. Many people are not able to use theorem provers to their full strength. The aim of our research is to make semi-automated theorem proving a real possibility for a wide range of people – from those primarily interested in formal specification, for whom proof is a chore, to developers of automated theorem proving systems themselves. We give an account of the advantages and limitations of the CLAM proof planning system, and describe how XBarnacle, a semi-automatic theorem prover, enhances the capabilities of CLAM.
منابع مشابه
The Use of Theorem Provers in the Teaching and Practice of Formal Methods
Our aim is to make formal methods, in particular that which has to do with proving properties of programs, more accessible. Our immediate objective is the provision of usable tools by applying principles from HCI to the design of semi-automated theorem provers. In this paper we describe the XBarnacle semi-automated proof tool based on the CLAM proof planning system. This system is more powerful...
متن کاملPhobos (Version 2): A Query Answering Plausible Logic System
This document is a description of Phobos, a query answering plausible logic system. Phobos is a complete implementation of propositional plausible logic. System components include command-linedriven theorem provers and a web-accessible theorem prover. The system has been implemented in Haskell. This is the short form of this document. The long form includes details about the implementation.
متن کاملInvited talk: Developments, Libraries and Automated Theorem Provers
When formalizing a mathematical development with an interactive prover, it is helpful if the user can interface with a library (to avoid starting from scratch) and with automated provers (to avoid needing to give full details explicitly). We will consider an example of a development in Mizar, leading to some discussion of how one can interact with Mizar's library and how automated theorem prove...
متن کاملOne Logic to Use Them All
Deductive program veri cation is making fast progress these days. One of the reasons is a tremendous improvement of theorem provers in the last two decades. This includes various kinds of automated theorem provers, such as ATP systems and SMT solvers, and interactive proof assistants. Yet most tools for program veri cation are built around a single theorem prover. Instead, we defend the idea th...
متن کاملTheorem Provers Survey
Theorem provers are computer programs capable of nding proofs for theorems within mathematical theories. Theorem provers have been an important part of the computer science eld. The birth of theorem provers could be traced to the 50's with the introduction of the electronic computer to the universities. This paper presents the actual classiication of theorem provers, and present an evaluation o...
متن کامل